Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
411	Feature Restoration and Distortion Metrics Ventsislav K. Chonev and Andrew D. Ker Oxford University Computing Laboratory, Parks Road, Oxford OX1 3QD, England. ABSTRACT Our work focuses on Feature Restoration (FR), a tech Add to Reading List Source URL: www.cs.ox.ac.uk Language: English - Date: 2010-12-12 17:23:39 Multivariate statistics Steganography Mahalanobis distance Bounded-error probabilistic polynomial Distortion Distance Steganalysis Time complexity Theoretical computer science Statistics Applied mathematics
412	A Polynomial Time Approximation Scheme for k-Consensus Clustering∗ Tom Coleman† Abstract This paper introduces a polynomial time approximation scheme for the metric Correlation Clustering problem, when the number of Add to Reading List Source URL: tom.thesnail.org Language: English - Date: 2015-05-04 03:09:24 Approximation algorithms Cluster analysis Combinatorial optimization NP-complete problems Complexity classes Correlation clustering Consensus clustering Optimization problem Minimum k-cut Theoretical computer science Computational complexity theory Statistics
413	SCORAM: Oblivious RAM for Secure Computation ∗ Xiao Shaun Wang Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2014-09-26 10:55:17 Oram Time complexity Hash table Circuit Binary tree Theoretical computer science Applied mathematics Analysis of algorithms
414	Job Shop Scheduling with Probabilistic Durations1 J. Christopher Beck and Nic Wilson2 Abstract. Proactive approaches to scheduling take into account information about the execution time uncertainty in forming a schedule. Add to Reading List Source URL: tidel.mie.utoronto.ca Language: English - Date: 2006-01-18 12:07:28 Operations research Complexity classes Probabilistic complexity theory Job shop scheduling Mathematical optimization Monte Carlo method Algorithm NP SL Theoretical computer science Applied mathematics Computational complexity theory
415	Parallelism in Sequential Guy Blelloch Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-04-26 13:42:59 Sorting algorithms Analysis of algorithms Complexity classes Models of computation Circuit complexity Quicksort NC Time complexity Merge sort Theoretical computer science Computational complexity theory Mathematics
416	A Linear Kernel for the Complementary Maximal Strip Recovery Problem Binhai Zhu Computer Science Department Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2012-12-29 15:19:34 Analysis of algorithms Parameterized complexity NP-complete problems Kernelization Time complexity Vertex cover Algorithm Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
417	COMS21103 NP-completeness (or how to prove that problems are probably hard) Ashley Montanaro Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-01-08 09:09:08 Complexity classes Analysis of algorithms Mathematical optimization Time complexity Algorithm P NP-complete P versus NP problem Quantum algorithm Theoretical computer science Computational complexity theory Applied mathematics
418	2 Priority-Flood: An Optimal Depression-Filling and Watershed-Labeling Algorithm for Digital Elevation Models 3 Add to Reading List Source URL: rbarnes.org Language: English - Date: 2013-10-24 03:01:10 Scheduling algorithms Computer science Priority queue Watershed Stack FIFO Heap Queue Time complexity Abstract data types Theoretical computer science Applied mathematics
419	The time scale of articial intelligence: Re ections on social eects Ray J. Solomono Visiting Professor, Computer Learning Research Center Royal Holloway, University of London Mailing Address: P.O.B, Add to Reading List Source URL: world.std.com Language: English - Date: 2014-09-18 21:18:33 Ethology Artificial intelligence Open problems Philosophy of mind Strong AI Mind Computational complexity theory Computer science Algorithm Science Computational neuroscience Philosophy of artificial intelligence
420	Two Improved Range-Eﬃcient Algorithms for F0 Estimation He Sun1,2 and Chung Keung Poon1 1 2 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2007-04-12 14:13:22 Analysis of algorithms Computational complexity theory Time complexity Logarithm Big O notation Streaming algorithm Factorization of polynomials over a finite field and irreducibility tests Euclidean algorithm Theoretical computer science Mathematics Applied mathematics

UPDATE